Adaptive Online Data Compression
نویسندگان
چکیده
Quickly transmitting large datasets in the context of distributed computing on wide area networks can be achieved by compressing data before transmission. However, such an approach is not efficient when dealing with higher speed networks. Indeed, the time to compress a large file and to send it is greater than the time to send the uncompressed file. In this paper, we explore and enhance an algorithm that allows us to overlap communications with compression and to automatically adapt the compression effort to currently available network and processor resources.
منابع مشابه
A Solution to the Problem of Extrapolation in Car Following Modeling Using an online fuzzy Neural Network
Car following process is time-varying in essence, due to the involvement of human actions. This paper develops an adaptive technique for car following modeling in a traffic flow. The proposed technique includes an online fuzzy neural network (OFNN) which is able to adapt its rule-consequent parameters to the time-varying processes. The proposed OFNN is first trained by an growing binary tree le...
متن کاملOptimal adaptive leader-follower consensus of linear multi-agent systems: Known and unknown dynamics
In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...
متن کاملA fast and efficient lossless data-compression method
This paper describes an online lossless datacompression method using adaptive arithmetic coding. To achieve good compression efficiency, we employ an adaptive fuzzy-tuning modeler that applies fuzzy inference to deal efficiently with the problem of conditional probability estimation. In comparison with other lossless coding schemes, the compression results of the proposed method are good and sa...
متن کاملApplying Compression to a Game's Network Protocol
This report presents the results of applying different compression algorithms to the network protocol of an online game. The algorithm implementations compared are zlib, liblzma and my own implementation based on LZ77 and a variation of adaptive Huffman coding. The comparison data was collected from the game TomeNET. The results show that adaptive coding is especially useful for compressing lar...
متن کاملCoding of Non-Stationary Sources as a Foundation for Detecting Change Points and Outliers in Binary Time-Series
An interesting scheme for estimating and adapting distributions in real-time for non-stationary data has recently been the focus of study for several different tasks relating to time series and data mining, namely change point detection, outlier detection and online compression/ sequence prediction. An appealing feature is that unlike more sophisticated procedures, it is as fast as the related ...
متن کاملA Fast and E cient Nearly-Optimal Adaptive Fano Coding Scheme
Adaptive coding techniques have been increasingly used in lossless data compression. They are suitable for a wide range of applications, in which on-line compression is required, including communications, internet, e-mail, and e-commerce. In this paper, we present an adaptive Fano coding method applicable to binary and multi-symbol code alphabets. We introduce the corresponding partitioning pro...
متن کامل